منابع مشابه
Enumeration of maps
This chapter is devoted to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem. Maps are fundamental objects in combinatorics and graph theory, originally introduced by Tutte in his series of " census " papers [Tut62a, Tut62b, Tut62c, Tut63]. Their connectio...
متن کاملAutomatic continuity of almost multiplicative maps between Frechet algebras
For Fr$acute{mathbf{text{e}}}$chet algebras $(A, (p_n))$ and $(B, (q_n))$, a linear map $T:Arightarrow B$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(Tab - Ta Tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{N}$, $a, b in A$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$...
متن کاملAlmost Multi-Cubic Mappings and a Fixed Point Application
The aim of this paper is to introduce $n$-variables mappings which are cubic in each variable and to apply a fixed point theorem for the Hyers-Ulam stability of such mapping in non-Archimedean normed spaces. Moreover, a few corollaries corresponding to some known stability and hyperstability outcomes are presented.
متن کاملEnumeration of cubic multigraphs on orientable surfaces
Let Sg be the orientable surface of genus g. We show that the number of edgelabelled cubic multigraphs embeddable on Sg with m = 3k edges is asymptotically dgγ −mm5/2(g−1)−1m!, where γ−1 = √ 79 3 2 −1/3 and cg is a constant only dependent on the genus.
متن کاملAlmost Enumeration of eight-variable Bent Functions
Bent functions are important cryptographic Boolean functions. In order to enumerate eight-variable bent functions, we solve the following three key problems. Firstly, under the action of AGL(7, 2), we almost completely classify R(4, 7)/R(2, 7). Secondly, we construct all seven-variable plateaued functions from the orbits of R(4, 7)/R(2, 7). Thirdly, we present a fast algorithm to expand plateau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1972
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90012-3